The Quantum Complexity of Group Testing
نویسندگان
چکیده
We present quantum query and time complexity bounds for group testing problems. For a set S and a binary operation on S, we consider the decision problem whether a groupoid, semigroup or quasigroup is a group. Our quantum algorithms for these problems improve the best known classical complexity bounds. We also present upper and lower bounds for testing associativity, distributivity and commutativity.
منابع مشابه
The Effects of Task Variation on the Accuracy and Complexity of Iranian EFL Learners’ Oral Performance
Task variation is an integrative method aiming at the importance of learner-to-learner interactions in a wide range of learning contexts and fostering authentic use of language and meaningful communication. This study investigated the impact of task variation on the accuracy and complexity of Iranian EFL learners’ oral speech. In so doing, 80 intermediate EFL learners, majoring English at the I...
متن کاملOptimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملar X iv : q ua nt - p h / 05 06 26 5 v 4 8 M ay 2 00 7 Quantum Complexity of Testing Group Commutativity ∗
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in Õ(k). The algorithm uses and highlights the power of the quantiz...
متن کاملar X iv : q ua nt - p h / 05 06 26 5 v 2 4 A ug 2 00 5 Quantum Complexity of Testing Group Commutativity ∗
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in Õ(k). The algorithm uses and highlights the power of the quantiz...
متن کاملar X iv : q ua nt - p h / 05 06 26 5 v 3 2 2 Ju n 20 06 Quantum Complexity of Testing Group Commutativity ∗
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in Õ(k). The algorithm uses and highlights the power of the quantiz...
متن کامل